Counting symmetric configurations v3

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Configurations in Designs

Given a t-(v, k, λ) design, form all of the subsets of the set of blocks. Partition this collection of configurations according to isomorphism and consider the cardinalities of the resulting isomorphism classes. Generalizing previous results for regular graphs and Steiner triple systems, we give linear equations relating these cardinalities. For any fixed choice of t and k, the coefficients in ...

متن کامل

Counting Triangulations of Configurations

Calculating the number of Euclidean triangulations of a convex polygon P with vertices in a finite subset C ⊂ R2 containing all vertices of P seems to be difficult and has attracted some interest, both from an algorithmic and a theoretical point of view, see for instance [1], [2], [3], [4], [5], [7], [9], [10], [11]. The aim of this paper is to describe a class of configurations, convex near-go...

متن کامل

Counting Symmetric Nilpotent Matrices

We determine the number of nilpotent matrices of order n over Fq that are selfadjoint for a given nondegenerate symmetric bilinear form, and in particular find the number of symmetric nilpotent matrices.

متن کامل

Counting Locally Symmetric Manifolds

We give quantitive estimates for the number of locally symmetric spaces of a given type with bounded volume. Explicitly, let S be a symmetric space of non-compact type without Euclidean de Rham factors. Then, after rescaling appropriately the Riemannian metric, the following hold. Theorem A If rank(S) = 1 and S ≇ H2,H3, then there are at most V V Riemannian manifolds, locally isometric to S, wi...

متن کامل

Robust Configurations for Symmetric Encryption

Recent advances in multimodal theory and unstable theory have paved the way for telephony. In fact, few hackers worldwide would disagree with the exploration of architecture, which embodies the private principles of software engineering. Our focus in our research is not on whether courseware [23] and von Neumann machines can agree to fulfill this intent, but rather on motivating an amphibious t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2000

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(99)00143-2